Automata-theoretic hierarchies
نویسندگان
چکیده
منابع مشابه
Relating Automata-Theoretic Hierarchies to Complexity-Theoretic Hierarchies
We show that some natural re nements of the Straubing and Brzozowski hierarchies correspond (via the so called leaf-languages) step by step to similar re nements of the polynomial-time hierarchy. This extends a result of H.-J. Burtschik and H. Vollmer on relationship between the Straubing and the polynomial hierarchies. In particular, this applies to the boolean hierarchy and the plus{hierarchy.
متن کاملITCH: Information-Theoretic Cluster Hierarchies
Hierarchical clustering methods are widely used in various scientific domains such as molecular biology, medicine, economy, etc. Despite the maturity of the research field of hierarchical clustering, we have identified the following four goals which are not yet fully satisfied by previous methods: First, to guide the hierarchical clustering algorithm to identify only meaningful and valid cluste...
متن کاملLookahead Hierarchies of Restarting Automata
The restarting automaton is a special kind of the linear bounded automaton with a read/write window of fixed length. It works in cycles, reducing the length of the actual word in each cycle. We study several versions of restarting automata and we show several hierarchies of language classes recognized by them with respect to the size of the read/write-window.
متن کاملAutomata-Theoretic Verification
This chapter describes the automata-theoretic approach to the satisfiability and model-checking problems for temporal logics. In a nutshell, the approach reduces these problems to standard decision problems about automata, like nonemptiness, language containment, or membership (whether a given object is accepted by a given automaton). These problems are solved using results of automata theory, ...
متن کاملAutomata-Theoretic Model Checking Revisited
In automata-theoretic model checking we compose the design under verification with a Büchi automaton that accepts traces violating the specification. We then use graph algorithms to search for a counterexample trace. The basic theory of this approach was worked out in the 1980s, and the basic algorithms were developed during the 1990s. Both explicit and symbolic implementations, such as SPIN an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2012
ISSN: 2075-2180
DOI: 10.4204/eptcs.96.0.2